Implicit Alternating Direction Methods

نویسندگان

  • GARRETT BIRKHOFF
  • RICHARD S. VARGA
چکیده

in general plane regions and with respect to linear boundary conditions, is a classical problem of numerical analysis. Many such boundary value problems have been solved successfully on high-speed computing machines, using the (iterative) Young-Frankel "successive overrelaxation" (SOR) method as defined in [l] and [2], and variants thereof ("line" and "block" overrelaxation). For this method, estimates of the rate of convergence and the "optimum relaxation factor" can both be rigorously extended from the special case of — \72u = S in a rectangle, and Dirichlet-type boundary conditions, to the general case. Recently, two variants [3; 4] of a new "implicit alternating direction" (IAD) method have been proved to converge much more rapidly, in the special case just mentioned, than the successive overrelaxation method and its variants. This fact has led to much speculation regarding the relative rates of convergence of SOR and IAD methods for more general elliptic boundary value problems. In [3, p. 41 ], success was reported in solving — S/2u = S for "several examples involving more complex regions and less simple boundary conditions," but no theoretical analysis was given of the convergence rate of the "Peaceman-Rachford" process used in these examples. In [4, p. 421 ], the "Douglas-Rachford" process was asserted to be stable (i.e., convergent) for — V2w = S and Dirichlet-type boundary conditions in general plane regions, but again the cases of variable D, S?^0, and mixed boundary conditions were not covered. Our main result below (Theorem 3) is that the convergence estimates given in [3] and [4] are applicable to the modified Helmholtz equation c2u — V2m = ,S in a rectangle with sides parallel to the axes, with the boundary condition du/dn+ku = 0, £2:0, and essentially to no other case. In dramatic contrast to the situation as regards SOR methods, the analysis of the rectangular case, via discrete Fourier analysis of eigenfunctions, gives no clue as to the general self-adjoint case. Nevertheless, IAD methods work well for many other cases of great interest. We present in §§8-9 also a few positive results, giving partial theoretical justification for this success.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Alternating Direction Implicit Method for Modeling of Fluid Flow

This research includes of the numerical modeling of fluids in two-dimensional cavity. The cavity flow is an important theoretical problem. In this research, modeling was carried out based on an alternating direction implicit via Vorticity-Stream function formulation. It evaluates different Reynolds numbers and grid sizes. Therefore, for the flow field analysis and prove of the ability of the sc...

متن کامل

High-accuracy alternating segment explicit-implicit method for the fourth-order heat equation

Based on a group of new Saul’yev type asymmetric difference schemes constructed by author, a high-order, unconditionally stable and parallel alternating segment explicit-implicit method for the numerical solution of the fourth-order heat equation is derived in this paper. The truncation error is fourth-order in space, which is much more accurate than the known alternating segment explicit-impli...

متن کامل

Numerical Assessment of Finite Difference Time Domain (FDTD) and Complex-Envelope Alternating-Direction-Implicit Finite-Difference-Time-Domain (CE-ADI-FDTD) Methods

A thorough numerical assessment of Finite Difference Time Domain and Complex-Envelope Alternating-Direction-Implicit Finite-Difference-Time-Domain Methods has been carried out based on a basic single mode Plane Optical Waveguide structure. Simulation parameters for both methods were varied and the impact on the performance of both numerical methods is investigated.

متن کامل

Krylov subspace methods for projected Lyapunov equations

We consider the numerical solution of projected Lyapunov equations using Krylov subspace iterative methods. Such equations play a fundamental role in balanced truncation model reduction of descriptor systems. We present generalizations of the extended block and global Arnoldi methods to projected Lyapunov equations and compare these methods with the alternating direction implicit method with re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010